The Cost of Compatible Refinement of Simplex Decomposition Trees
نویسندگان
چکیده
A hierarchical simplicial mesh is a recursive decomposition of space into cells that are simplices. Such a mesh is compatible if pairs of neighboring cells meet along a single common face. Compatibility condition is important in many applications where the mesh serves as a discretization of a function. Enforcing compatibility involves refining the simplices of the mesh further, thus generates a larger mesh. We show that the size of a simplicial mesh grows by no more than a constant factor when compatibly refined. We prove a tight upper bound on the expansion factor for 2-dimensional meshes, and we sketch upper bounds for d-dimensional meshes.
منابع مشابه
Aesthetic Evaluation of Autumn Landscape of Hyrcanian Native Trees Species for Use in Urban Landscape (A Case Study in Sari City Area of Iran)
Recent decades have witnessed the growing use of non-native plants in Iran while their use is very challenging and high-cost for the country. This raised a new approach in recent decades towards the use of native plants. Native species are precious because they possess the main ecological factors and they are already compatible with the region. Accordingly, this research was conducted to evalua...
متن کاملGeneralization of Decomposed Integration Methods for Cost Effective Heat Exchanger Networks with Multiple Cost Laws
At many circumstances, in heat exchange processes several exchangers were used with different cost laws due to their pressure ratings, materials of construction and exchange3r types. In such circumstances traditional methods of pinch technology can not be led to minimum total annual cost may cause some other disadvantages like more complexity or higher maintenance. In this research work a n...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملTzanck smears in herpes simplex virus infections
Background: The diagnosis of herpes simplex virus may requirevirological confirmation. Tzanck smear is an old, rapid, costeffective but nonspecific method that has been recently re-evaluatedas a method for the diagnosis of herpes virus infection. This studywas conducted to compare Tzanck smear and viral culture in thediagnosis of herpes simplex virus infection in patients clinicallysuspected to...
متن کامل